Optimal vaccination schedules using simulated annealing
نویسندگان
چکیده
SUMMARY Since few years the problem of finding optimal solutions for drug or vaccine protocols have been tackled using system biology modeling. These approaches are usually computationally expensive. Our previous experiences in optimizing vaccine or drug protocols using genetic algorithms required the use of a high performance computing infrastructure for a couple of days. In the present article we show that by an appropriate use of a different optimization algorithm, the simulated annealing, we have been able to downsize the computational effort by a factor 10(2). The new algorithm requires computational effort that can be achieved by current generation personal computers. AVAILABILITY Software and additional data can be found at http://www.immunomics.eu/SA/
منابع مشابه
Best-so-far vs. where-you-are: New perspectives on simulated annealing for CAD
The simulated annealing (SA) algorithm [14] [5] has been applied to every di cult optimization problem in VLSI CAD. Existing SA implementations use monotone decreasing, or cooling, temperature schedules motivated by the algorithm's proof of optimality as well as by an analogy with statistical thermodynamics. This paper gives strong evidence that challenges the correctness of using such schedule...
متن کاملSimulated annealing of neural networks: The 'cooling' strategy reconsidered
The simulated annealing (SA) algorithm [12] [5] has been widely used to address intractable global optimizations in many elds, including training of articial neural networks. Implementations of annealing universally use a monotone decreasing, or \cooling", temperature schedule which is motivated by the algorithm's proof of optimality as well as analogies with statistical thermodynamics. In this...
متن کاملOptimizing SOC Test Resources using Dual Sequences
In this paper, we propose a new data structure called dual sequences to represent SOC test schedules. Dual sequences are used together with a simulated annealing based procedure to optimize the SOC test application time and tester resources. The problems we consider are generation of optimal test schedules for SOCs and minimizing tester memory and test channels. Results of experiments conducted...
متن کاملA Simulated Annealing Algorithm for System-on-Chip Test Scheduling with, Power and Precedence Constraints
This paper presents an efficient method to determine minimum System-OnChip (SOC) test schedules with precedence and power constraints based on simulated annealing. The problem is solved using a partitioned testing scheme with run to completion that minimizes the number of idle test slots. The method can handle SOC test scheduling with and without power constraints in addition to precedence cons...
متن کاملLocal Search Strategy to produce Schedules for a GPS Surveying Network
This paper introduces a new formulation for GPS networks which is an important technique in Surveying. The objective is to find an effective receiver schedule at least cost using heuristic techniques within the field of Operational Research. To evaluate the solution, a comparison with known optimal solution is made. Large networks (with unknown optimal schedules) were solved using Simulated Ann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 24 15 شماره
صفحات -
تاریخ انتشار 2008